First-Order Inquisitive Pair Logic
نویسنده
چکیده
We introduce two different calculi for a first-order extension of inquisitive pair semantics (Groenendijk 2008): Hilbert-style calculus and Tree-sequent calculus. These are first-order generalizations of (Mascarenhas 2009) and (Sano 2009), respectively. First, we show the strong completeness of our Hilbert-style calculus via canonical models. Second, we establish the completeness and soundness of our Tree-sequent calculus. As a corollary of the results, we semantically establish that our Tree-sequent calculus enjoys a cut-elimination theorem.
منابع مشابه
A generalized inquisitive semantics.∗
In Inquisitive Semantics, formulas are evaluated on ordered pairs of indices; actually, the order of the pair is irrelevant, so these pairs could just just as well be taken to be non-empty sets of indices of cardinality at most two. This last restriction, however, sounds particularly unnatural, especially considering that the definition of inquisitive semantics can be easily reformulated in suc...
متن کاملInquisitive bisimulation
Inquisitive modal logic InqML is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. Technically, InqML fits within the family of logics based on team semantics. From a model-theoretic perspective, it takes us a step in th...
متن کاملStructural Multi-type Sequent Calculus for Inquisitive Logic
In this paper, we define a multi-type calculus for inquisitive logic, which is sound, complete and enjoys Belnap-style cut-elimination and subformula property. Inquisitive logic is the logic of inquisitive semantics, a semantic framework developed by Groenendijk, Roelofsen and Ciardelli which captures both assertions and questions in natural language. Inquisitive logic is sound and complete w.r...
متن کاملAn Ehrenfeucht-fraïssé Game for Inquisitive First-order Logic
Inquisitive first-order logic, InqBQ, extends classical first-order logic with questions. From a technical perspective, InqBQ allows us to talk about a plurality of first-order structures, expressing not only facts about each structure in isolation, but also about how these structures relate to each other. We describe an Ehrenfeucht-Fräıssé game for InqBQ and show that this characterizes the ex...
متن کاملInquisitive semantics — NASSLLI 2012 lecture notes — Ivano Ciardelli
1 4 Inquisitive semantics 17 4.1 Inquisitive semantics for a first-order language . . . . . . . . . 18 4.2 Semantic categories . . . . . . . . . . . . . . . . . . . . . . . . 20 4.3 Information and truth . . . . . . . . . . . . . . . . . . . . . . 22 4.4 Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 4.5 Syntactic properties of questions and assertions . . . . . . . . 28 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011